The square Frobenius number
نویسندگان
چکیده
Let $$S=\left\langle s_1,\ldots ,s_n\right\rangle $$ be a numerical semigroup generated by the relatively prime positive integers $$s_1,\ldots ,s_n$$ . $$k\geqslant 2$$ an integer. In this paper, we consider following k-power variant of Frobenius number S defined as $$\begin{aligned} {}^{k\!}r\!\left( S\right) := \text { largest } k {-power integer not belonging to S. \end{aligned}$$ investigate case $$k=2$$ We give upper bound for $${}^{2\!}r\!\left( S_A\right) infinite family semigroups $$S_A$$ arithmetic progressions. The latter turns out exact value \left\langle s_1,s_2\right\rangle \right) under certain conditions. present formula s_1,s_1+d \right\rangle when $$d=3,4$$ and 5, study s_1,s_1+1 s_1,s_1+2 put forward two relevant conjectures. finally discuss some related questions.
منابع مشابه
The Frobenius Coin Problem Upper Bounds on The Frobenius Number
In its simplest form, the coin problem is this: what is the largest positive amount of money that cannot be obtained using two coins of specified distinct denominations? For example, using coins of 2 units and 3 units, it is easy so see that every amount greater than or equal to 2 can be obtained, but 1 cannot be obtained. Using coins of 2 units and 5 units, every amount greater than or equal t...
متن کاملSquare-free discriminants of Frobenius rings
Let E be an elliptic curve over Q. It is well known that the ring of endomorphisms of Ep, the reduction of E modulo a prime p of ordinary reduction, is an order of the quadratic imaginary field Q(πp) generated by the Frobenius element πp. When the curve has complex multiplication (CM), this is always a fixed field as the prime varies. However, when the curve has no CM, very little is known, not...
متن کاملTitle Subspace segmentation with a minimal square frobenius norm
We introduce a novel subspace segmentation method called Minimal Squared Frobenius Norm Representation (MSFNR). MSFNR performs data clustering by solving a convex optimization problem. We theoretically prove that in the noiseless case, MSFNR is equivalent to the classical Factorization approach and always classifies data correctly. In the noisy case, we show that on both synthetic and real-word...
متن کاملOn the Frobenius Number of a Modular Diophantine Inequality
We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality ax mod b 6 x, with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.
متن کاملOn the Number of Square-free Permutations
A permutation is square-free if it does not contain two consecutive factors of length more than one that coincide in the reduced form (as patterns). We prove that the number of square-free permutations of length n is nn(1−εn) where εn → 0 when n →∞.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2022
ISSN: ['0037-1912', '1432-2137']
DOI: https://doi.org/10.1007/s00233-022-10289-z